Sign in
Facet browsing currently unavailable
Page 1 of 12730 results
Sort by: relevance publication year
|
Solving Interval Linear Systems is NP-Hard BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Interval Linear Systems: Search for Feasible Classes BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Non-Interval Uncertainty II: Multi-Intervals and Their Generalizations BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Some computational problems in linear algebra as hard as matrix multiplication JOURNAL ARTICLE published June 1991 in Computational Complexity |
|
Informal Introduction: Data Processing, Interval Computations, and Computational Complexity BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
For Fractionally-Linear Functions, a Feasible Algorithm Solves the Basic Problem of Interval Computations BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
What if We only Allow some Arithmetic Operations in Data Processing? BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Bright Sides of NP-Hardness of Interval Computations I: NP-Hard Means That Good Interval Heuristics can Solve other Hard Problems BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Approximation of Interval Functions BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Physical Corollary: Prediction is not Always Possible, Even for Linear Systems with Known Dynamics BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Properties of Interval Matrices I: Main Results BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Non-Interval Uncertainty I: Ellipsoid Uncertainty and its Generalizations BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Fixed Data, Varying Data Processing Algorithms: Still Intractable BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Properties of Interval Matrices II: Proofs and Auxiliary Results BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Optimization — a First Example of a Numerical Problem in which Interval Methods are used: Computational Complexity and Feasibility BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Basic Problem of Interval Computations for Polynomials with Bounded Coefficients BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Basic Problem of Interval Computations for Polynomials of Fixed Order BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
Fixed Data Processing Algorithms, Varying Data: Still NP-Hard BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |
|
On the complexity of some data analysis problems JOURNAL ARTICLE published November 2010 in Computational Mathematics and Mathematical Physics |
|
Solving Differential Equations BOOK CHAPTER published 1998 in Computational Complexity and Feasibility of Data Processing and Interval Computations |